Proof of the Feldman-Karlin conjecture on the maximum number of equilibria in an evolutionary system.
نویسنده
چکیده
Feldman and Karlin conjectured that the number of isolated fixed points for deterministic models of viability selection and recombination among n possible haplotypes has an upper bound of 2(n)-1. Here a proof is provided. The upper bound of 3(n-1) obtained by Lyubich et al. (2001) using Bézout's Theorem (1779) is reduced here to 2(n) through a change of representation that reduces the third-order polynomials to second order. A further reduction to 2(n)-1 is obtained using the homogeneous representation of the system, which yields always one solution 'at infinity'. While the original conjecture was made for systems of selection and recombination, the results here generalize to viability selection with any arbitrary system of bi-parental transmission, which includes recombination and mutation as special cases. An example is constructed of a mutation-selection system that has 2(n)-1 fixed points given any n, which shows that 2(n)-1 is the sharpest possible upper bound that can be found for the general space of selection and transmission coefficients.
منابع مشابه
A short proof of the maximum conjecture in CR dimension one
In this paper and by means of the extant results in the Tanaka theory, we present a very short proof in the specific case of CR dimension one for Beloshapka's maximum conjecture. Accordingly, we prove that each totally nondegenerate model of CR dimension one and length >= 3 has rigidity. As a result, we observe that the group of CR automorphisms associated with each of such models contains onl...
متن کاملOn the oriented perfect path double cover conjecture
An oriented perfect path double cover (OPPDC) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each arc of $G_s$ lies in exactly one of the paths and each vertex of $G$ appears just once as a beginning and just once as an end of a path. Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete Math. 276 (2004) 287-294) conjectured that ...
متن کاملOn the Closed-Form Solution of a Nonlinear Difference Equation and Another Proof to Sroysang’s Conjecture
The purpose of this paper is twofold. First we derive theoretically, using appropriate transformation on x(n), the closed-form solution of the nonlinear difference equation x(n+1) = 1/(±1 + x(n)), n ∈ N_0. The form of solution of this equation, however, was first obtained in [10] but through induction principle. Then, with the solution of the above equation at hand, we prove a case ...
متن کاملPartial proof of Graham Higman's conjecture related to coset diagrams
Graham Higman has defined coset diagrams for PSL(2,ℤ). These diagrams are composed of fragments, and the fragments are further composed of two or more circuits. Q. Mushtaq has proved in 1983 that existence of a certain fragment γ of a coset diagram in a coset diagram is a polynomial f in ℤ[z]. Higman has conjectured that, the polynomials related to the fragments are monic and for a fixed degree...
متن کاملFrankl's Conjecture for a subclass of semimodular lattices
In this paper, we prove Frankl's Conjecture for an upper semimodular lattice $L$ such that $|J(L)setminus A(L)| leq 3$, where $J(L)$ and $A(L)$ are the set of join-irreducible elements and the set of atoms respectively. It is known that the class of planar lattices is contained in the class of dismantlable lattices and the class of dismantlable lattices is contained in the class of lattices ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theoretical population biology
دوره 77 4 شماره
صفحات -
تاریخ انتشار 2010